Computational Complexity of Two-Dimensional Platform Games
نویسنده
چکیده
We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorems: general constructions that allow us to identify a class of these games for which the set of solvable levels is NP-hard, and another class for which the set is even PSPACE-hard. Notably CommanderKeen is shown to be NP-hard, and PrinceOfPersia is shown to be PSPACE-complete. We then analyze the related game Lemmings, where we show that an assumption made by Cormode in [3] is false. We construct a set of instances which only have exponentially long solutions. Thereby we invalidate Cormode’s proof that the general version of the Lemmings decision problem is in NP. We then augment our construction to only include one entrance, which makes our instances perfectly natural within the context of the original game.
منابع مشابه
Image Restoration with Two-Dimensional Adaptive Filter Algorithms
Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...
متن کاملمقایسۀ تأثیر مداخلهای بازیهای ویدیویی سه بعدی و دو بعدی بر خلاقیت و مهارتهای اجتماعی دانشجویان پسر
In recent years, there has been an increase in the playing of digital games in children, adolescents and adults worldwide. Not only has interest in digital games grown dramatically, but variations in the types of games in different fields have also occurred. An example is the emergence of three- and two-dimensional games. Based on this, the purpose of this study was to investigate the effect of...
متن کاملApplication of the Schwarz-Christoffel Transformation in Solving Two-Dimensional Turbulent Flows in Complex Geometries
In this paper, two-dimensional turbulent flows in different and complex geometries are simulated by using an accurate grid generation method. In order to analyze the fluid flow, numerical solution of the continuity and Navier-Stokes equations are solved using CFD techniques. Considering the complexity of the physical geometry, conformal mapping is used to generate an orthogonal grid by means of...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملExperiments with Online Reinforcement Learning in Real-Time Strategy Games
Real-Time Strategy (RTS) games provide a challenging platform to implement online reinforcement learning (RL) techniques in a real application. Computer as one player monitors opponents’ (human or other computers) strategies and then updates its own policy using RL methods. In this paper, we firstly examine the suitability of applying the online RL in various computer games. RL application depe...
متن کامل